A novel two-stage approach for energy-efficient timetabling for an urban rail transit network

Urban rail transit (URT) is the backbone transport mode in metropolitan areas to accommodate large travel demands. The high energy consumption of URT becomes a hotspot problem due ever-increasing operation mileages and pressing agendas carbon neutralization. model complexity inconsistency objectives minimizing passenger time operational are main challenges for energy-efficient timetabling network with multiple interlinked lines. This study proposes general framework path choice minimize under constraints. To obtain satisfactory nonuniform timetables, we suggest novel reformulation as tree knapsack determine train running times by pseudo-polynomial dynamic programming algorithm first stage. Furthermore, heuristic sequencing method developed headways dwell second suggested solution tested using real-world network, results show that can be considerably reduced given certain increments.